Robust Approximation of Generalized Biot-Brinkman Problems

نویسندگان

چکیده

The generalized Biot-Brinkman equations describe the displacement, pressures and fluxes in an elastic medium permeated by multiple viscous fluid networks can be used to study complex poromechanical interactions geophysics, biophysics other engineering sciences. These extend on Biot multiple-network poroelasticity one hand Brinkman flow models hand, as such embody a range of singular perturbation problems realistic parameter regimes. In this paper, we introduce, theoretically analyze numerically investigate class three-field finite element formulations equations. By introducing appropriate norms, demonstrate that proposed discretization, well associated preconditioning strategy, is robust with respect relevant theoretical analysis complemented numerical examples.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation Algorithms for Generalized Assignment Problems

We consider a class of max-profit scheduling problems that occur naturally in many different applications, all involving assignment of jobs to multiple resources under a set of constraints. In the Max-Profit Generalized Assignment Problem (Max-GAP), we are given a set J of m bins (knapsacks), and a set I of n items. Each bin j ∈ J has capacity c(j). Each item i ∈ I has in bin j size `(i, j) and...

متن کامل

On the Generalized Matrix Approximation Problems in the Spectral Norm

In this paper theoretical results regarding a generalized minimum rank matrix approximation problem in the spectral norm are presented. An alternative solution expression for the generalized matrix approximation problem is obtained. This alternative expression provides a simple characterization of the achievable minimum rank, which is shown to be the same as the optimal objective value of the c...

متن کامل

Generalized p-Center problems: Complexity results and approximation algorithms

In an earlier paper Hud91], two \alternative" p-Center problems, where the centers serving customers must be chosen so that exactly one node from each of p prespeciied disjoint pairs of nodes is selected, were shown to be NP-complete. This paper considers a generalized version of these problems, in which the nodes from which the p servers are to be selected are partitioned into k sets and the n...

متن کامل

Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems

We consider natural generalizations of the minimum broadcast time problem under the telephone model, where a rumor from a root node must be sent via phone calls to the whole graph in the minimum number of rounds; the telephone model implies that the set of edges involved in communicating in a round form a matching. The extensions we consider involve generalizing the number of calls that a verte...

متن کامل

Approximation schemes for the generalized geometric problems with geographic clustering

This paper is concerned with polynomial time approximations schemes for the generalized geometric problems with geographic clustering. We illustrate the approach on the generalized traveling salesman problem which is also known as Group-TSP or TSP with neighborhoods. We prove that under the condition that all regions are non-intersecting and have comparable sizes and shapes, the problem admits ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scientific Computing

سال: 2022

ISSN: ['1573-7691', '0885-7474']

DOI: https://doi.org/10.1007/s10915-022-02029-w